Sustainable hierarchical multi-modal hub network design problem: bi-objective formulations and solution algorithms

نویسندگان

چکیده

Abstract This paper presents a bi-objective model for the design and optimization of sustainable hierarchical multi-modal hub network. The proposed focuses on sustainability by considering economic, environmental, social aspects decisions in A case Turkish network freight transportation is used to validate model. To solve small-sized problems, augmented epsilon constraint method version 2 (AUGMECON2) applied. It can be inferred from Pareto-optimal set obtained AUGMECON2 that effect increasing number hubs after threshold marginal. current contribution proposes two multi-objective genetic algorithms (NSGA-II NRGA), which incorporate LP solving Dijkstra algorithm. results show superiority NRGA compared NSGA-II terms solution time. Also, we present an alternative, more efficient formulation problem. Based alternative formulation, addition AUGMECON2, use exact methods, including Torabi Hassini (TH) weighted Tchebycheff procedure (AWTP), find solutions small, medium, large-sized problems (including study). performance methods measured using some indicators. AUGMECON2.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bi-objective optimization of multi-server intermodal hub-location-allocation problem in congested systems: modeling and solution

A new multi-objective intermodal hub-location-allocation problem is modeled in this paper in which both the origin and the destination hub facilities are modeled as an M/M/m queuing system. The problem is being formulated as a constrained bi-objective optimization model to minimize the total costs as well as minimizing the total system time. A small-size problem is solved on the GAMS software t...

متن کامل

Capacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search

The goals of hub location problems are finding the location of hub facilities and determining the allocation of non-hub nodes to these located hubs. In this work, we discuss the multi-modal single allocation capacitated p-hub covering problem over fully interconnected hub networks. Therefore, we provide a formulation to this end. The purpose of our model is to find the location of hubs and the ...

متن کامل

Complete / Incomplete Hierarchical Hub Center Single Assignment Network Problem

In this paper we present the problem of designing a three level hub center network. In our network, the top level consists of a complete network where a direct link is between all central hubs.  The second and third levels consist of star networks that connect the hubs to central hubs and the demand nodes to hubs and thus to central hubs, respectively. We model this problem in an incomplete net...

متن کامل

Bi-objective Optimization of a Multi-product multi-period Fuzzy Possibilistic Capacitated Hub Covering Problem: NSGA-II and NRGA Solutions

The hub location problem is employed for many real applications, including delivery, airline and telecommunication systems and so on. This work investigates on hierarchical hub network in which a three-level network is developed. The central hubs are considered at the first level, at the second level, hubs are assumed which are allocated to central hubs and the remaining nodes are at the third ...

متن کامل

Design of a Bi-Objective Capacitated Single-Allocation Incomplete Hub Network Considering an Elastic Demand

This paper presents a bi-objective capacitated hub arc location problem with single assignment for designing a metro network with an elastic demand. In the literature, it is widely supposed that the network created with the hub nodes is complete. In this paper, this assumption is relaxed. Moreover, in most hub location problems, the demand is assumed to be static and independent of the location...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operational Research

سال: 2023

ISSN: ['1866-1505', '1109-2858']

DOI: https://doi.org/10.1007/s12351-023-00767-9